Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Search Algorithms for the multi-depot dial-a-ride problem with heterogeneous vehicles and users
In this work, a study on Variable Neighborhood Search algorithms for multi-depot dial-a-ride problems is presented. In dial-a-ride problems patients need to be transported from pre-specified pickup locations to pre-specified delivery locations, under different considerations. The addressed problem presents several constraints and features, such as heterogeneous vehicles, distributed in differen...
متن کاملOnline multi-server dial-a-ride problems
In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible objective functions include minimizing the makespan and minimizing the sum of completion times. We give competitive algorithms and negative results for several online dial-a-ride problems with multiple servers. Surprisingly, in some cases the competitive ratio is dram...
متن کاملDistributed Approch Using NSGAII Algorithm to Solve the Dynamic Dial a Ride Problem
THE DRP (dial a ride problem) consists on determining and planifiying the operated tours of vehicles in order to satisfy the user’s requests hoping to become origin’s points to destination’s points. The DRP is bind to NPdifficult problems, in order to solve it, many researchers have been used multi objective approached methods; actually our approach consists on reducing the number of vehicles, ...
متن کاملA Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem
In this paper, we mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. We formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. We propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve t...
متن کاملThe Dial-A-Ride Problem with Transfers
The Dial–A–Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT invo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part E: Logistics and Transportation Review
سال: 2016
ISSN: 1366-5545
DOI: 10.1016/j.tre.2016.10.002